An Approximation Ratio for Biclustering
نویسندگان
چکیده
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering by applying one-way clustering algorithms independently on the rows and on the columns of the input matrix. We show that such a solution yields a worst-case approximation ratio of 1+ √ 2 under L1-norm for 0–1 valued matrices, and of 2 under L2-norm for real valued matrices.
منابع مشابه
Approximation Algorithms for Bi-clustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns. This is the so-called biclustering problem. In this paper, we consider two variations of the biclustering problem: the consensus submatrix problem and the bottleneck submatrix pr...
متن کاملAnalysis of DNA Chips and Gene Networks Spring Semester , 2009 Lecture 11 : December 31 , 2009
In the course we have already seen different Biclustering methods such as Cheng-Church, ISA, SAMBA (see scribe 5), OPSM (see scribe 9). The method described in this lecture is Bimax an algorithm due to Prelić et al. [2]. It uses a simple data model reflecting the fundamental idea of biclustering, while aiming to determine all optimal biclusters in reasonable time. This method has the benefit of...
متن کاملA New Survey on Biclustering of Microarray Data
There are subsets of genes that have similar behavior under subsets of conditions, so we say that they coexpress, but behave independently under other subsets of conditions. Discovering such coexpressions can be helpful to uncover genomic knowledge such as gene networks or gene interactions. That is why, it is of utmost importance to make a simultaneous clustering of genes and conditions to ide...
متن کاملA Convex Optimization Framework for Bi-Clustering
We present a framework for biclustering and clustering where the observations are general labels. Our approach is based on the maximum likelihood estimator and its convex relaxation, and generalizes recent works in graph clustering to the biclustering setting. In addition to standard biclustering setting where one seeks to discover clustering structure simultaneously in two domain sets, we show...
متن کاملA New Study on Biclustering Tools, Biclusters Validation and Evaluation Functions
There are subsets of genes that have similar behavior under subsets of conditions, so we say that they coexpress, but behaveindependently under other subsets of conditions. Discovering such coexpressions can be helpful to uncover genomic knowledge such as gene networks or gene interactions. That is why, it is of utmost importance to make a simultaneous clustering of genes and conditions to iden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 108 شماره
صفحات -
تاریخ انتشار 2008